depth first search造句

例句与造句

1. There was the random search and the depth first search.
2. Topologically, this is a depth first search algorithm.
3. If was found that depth first search gave a speed up of 15 times versus a random search.
4. The method of defining the linked list specifies the use of a singly linked list will result in a depth first search strategy.
5. Therefore, like simpler graph search algorithms such as breadth-first search and depth first search, this algorithm takes linear time.
6. It's difficult to find depth first search in a sentence. 用depth first search造句挺难的
7. Let S be the sequence obtained by visiting the elements in T _ 2 in preorder ( i . e ., depth first search order ).
8. They also showed that they are familiar with graph searches and mentioned the depth first search, which for at least some mazes is an optimal solution.
9. Likewise, if the depth first search does not find a strongly connected component with both phases of a variable, then the 2-SAT problem is satisfiable.
10. The depth first search is where agents follow one path as far as it can go then return and try another path if the path they traversed does not contain an exit.
11. Once a 2-SAT problem is reduced to a graph, then if a depth first search finds a strongly connected component with both phases of a variable, then the 2-SAT problem is not satisfiable.
12. If not, the shallow depth first search tree can be used to construct a tree decomposition with bounded width, and standard dynamic programming techniques for graphs of bounded treewidth can be used to compute the depth in linear time.
13. More specifically, the dependence on " n " in this algorithm can be made linear, by the following method : compute a depth first search tree, and test whether this tree's depth is greater than 2 " d ".
14. In any graph, directed or undirected, there is a straightforward algorithm for finding a widest path once the weight of its minimum-weight edge is known : simply delete all smaller edges and search for any path among the remaining edges using breadth first search or depth first search.